Composition limits and separating examples for some boolean function complexity measures

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity and Probability of Some Boolean Formulas

For any Boolean function f let L f be its formula size complexity in the basis f g For every n and every k n we describe a probabilistic distribution on formulas in the basis f g in some given set of n variables and of the size at most k k Let pn k f be the probability that the formula chosen from the distribution computes the function f For every function f with L f k where log we have pn k f ...

متن کامل

Complexity Measures of Cryptographically Secure Boolean Functions

In stream cipher cryptography a pseudorandom sequence of bits of length equal to the message length is generated. This sequence is then bitwise XORed (addition modulo 2) with the message sequence and the resulting sequence is transmitted. At the receiving end, deciphering is done by generating the same pseudorandom sequence and bitwise XORing the cipher bits with the random bits. The seed of th...

متن کامل

Boolean Function Complexity and Neural Networks

A new neural network (NN) approach is proposed in this paper to estimate the Boolean function (BF) complexity. Large number of randomly generated single output BFs has been used and experimental results show good correlation between the theoretical results and those predicted by the NN model. The proposed model is capable of predicting the number of product terms (NPT) in the BF that gives an i...

متن کامل

Boolean Function Complexity - Advances and Frontiers

(Disclaimer: I was one of the proofreaders for two chapters of this book.) In 1986 David S. Johnson published a survey in his NP-Completeness Column called Computing with One Hand Tied Behind Your Back. To quote it . . . in the circuit complexity model the best lower bound known for a problem in NP has only increased from 2.5n to 3n since [G&J] (Garey and Johnson) was published seven years ago....

متن کامل

The Sample Complexity and Computational Complexity of Boolean Function Learning

This report surveys some key results on the learning of Boolean functions in a probabilistic model that is a generalization of the well-known ‘PAC’ model. A version of this is to appear as a chapter in a book on Boolean functions, but the report itself is relatively self-contained.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorica

سال: 2016

ISSN: 0209-9683,1439-6912

DOI: 10.1007/s00493-014-3189-x